0.02/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.02/0.10	% Command    : run_E %s %d THM
0.09/0.30	% Computer : n016.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 960
0.09/0.30	% WCLimit    : 120
0.09/0.30	% DateTime   : Tue Aug  9 05:50:57 EDT 2022
0.09/0.30	% CPUTime    : 
0.14/0.41	Running higher-order on 8 cores theorem proving
0.14/0.41	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.14/0.41	# Version: 3.0pre003-ho
0.14/0.42	# Preprocessing class: HSSSSMSSSLSNSFN.
0.14/0.42	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.42	# Starting ho_unfolding_3 with 600s (5) cores
0.14/0.42	# Starting post_as_ho5 with 120s (1) cores
0.14/0.42	# Starting sh4l with 120s (1) cores
0.14/0.42	# Starting ho_unfolding_2 with 120s (1) cores
0.14/0.42	# sh4l with pid 15991 completed with status 0
0.14/0.42	# Result found by sh4l
0.14/0.42	# Preprocessing class: HSSSSMSSSLSNSFN.
0.14/0.42	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.42	# Starting ho_unfolding_3 with 600s (5) cores
0.14/0.42	# Starting post_as_ho5 with 120s (1) cores
0.14/0.42	# Starting sh4l with 120s (1) cores
0.14/0.42	# No SInE strategy applied
0.14/0.42	# Search class: HHUNF-FFSF00-SSFFMSBN
0.14/0.42	# partial match(1): HHUNF-FFSF00-SSSFMSBN
0.14/0.42	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.14/0.42	# Starting ho_unfolding_3 with 65s (1) cores
0.14/0.42	# ho_unfolding_3 with pid 15994 completed with status 0
0.14/0.42	# Result found by ho_unfolding_3
0.14/0.42	# Preprocessing class: HSSSSMSSSLSNSFN.
0.14/0.42	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.14/0.42	# Starting ho_unfolding_3 with 600s (5) cores
0.14/0.42	# Starting post_as_ho5 with 120s (1) cores
0.14/0.42	# Starting sh4l with 120s (1) cores
0.14/0.42	# No SInE strategy applied
0.14/0.42	# Search class: HHUNF-FFSF00-SSFFMSBN
0.14/0.42	# partial match(1): HHUNF-FFSF00-SSSFMSBN
0.14/0.42	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.14/0.42	# Starting ho_unfolding_3 with 65s (1) cores
0.14/0.42	# Preprocessing time       : 0.001 s
0.14/0.42	# Presaturation interreduction done
0.14/0.42	
0.14/0.42	# Proof found!
0.14/0.42	# SZS status Theorem
0.14/0.42	# SZS output start CNFRefutation
0.14/0.42	thf(decl_22, type, leibeq: $i > $i > $o).
0.14/0.42	thf(decl_23, type, esk1_0: $i).
0.14/0.42	thf(decl_24, type, esk2_0: $i).
0.14/0.42	thf(decl_25, type, epred1_0: $i > $o).
0.14/0.42	thf(leibeq, axiom, ((leibeq)=(^[X1:$i, X2:$i]:(![X3:$i > $o]:(((X3 @ X1)=>(X3 @ X2)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', leibeq)).
0.14/0.42	thf(conj, conjecture, ![X1:$i, X2:$i]:(((leibeq @ X1 @ X2)=>(leibeq @ X2 @ X1))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)).
0.14/0.42	thf(c_0_2, plain, ((leibeq)=(^[Z0:$i, Z1:$i]:(![X3:$i > $o]:(((X3 @ Z0)=>(X3 @ Z1)))))), inference(fof_simplification,[status(thm)],[leibeq])).
0.14/0.42	thf(c_0_3, negated_conjecture, ~(![X1:$i, X2:$i]:((![X6:$i > $o]:(((X6 @ X1)=>(X6 @ X2)))=>![X7:$i > $o]:(((X7 @ X2)=>(X7 @ X1)))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_2])).
0.14/0.42	thf(c_0_4, negated_conjecture, ![X10:$i > $o]:(((~(X10 @ esk1_0)|(X10 @ esk2_0))&((epred1_0 @ esk2_0)&~(epred1_0 @ esk1_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])).
0.14/0.42	thf(c_0_5, negated_conjecture, ![X3:$i > $o]:(((X3 @ esk2_0)|~((X3 @ esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.14/0.42	thf(c_0_6, negated_conjecture, ~((epred1_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
0.14/0.42	thf(c_0_7, negated_conjecture, ((esk1_0)=(esk2_0)), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_5])).
0.14/0.42	thf(c_0_8, negated_conjecture, (epred1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_4])).
0.14/0.42	thf(c_0_9, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6, c_0_7]), c_0_8])]), ['proof']).
0.14/0.42	# SZS output end CNFRefutation
0.14/0.42	# Parsed axioms                        : 3
0.14/0.42	# Removed by relevancy pruning/SinE    : 0
0.14/0.42	# Initial clauses                      : 4
0.14/0.42	# Removed in clause preprocessing      : 1
0.14/0.42	# Initial clauses in saturation        : 3
0.14/0.42	# Processed clauses                    : 7
0.14/0.42	# ...of these trivial                  : 0
0.14/0.42	# ...subsumed                          : 0
0.14/0.42	# ...remaining for further processing  : 7
0.14/0.42	# Other redundant clauses eliminated   : 0
0.14/0.42	# Clauses deleted for lack of memory   : 0
0.14/0.42	# Backward-subsumed                    : 0
0.14/0.42	# Backward-rewritten                   : 2
0.14/0.42	# Generated clauses                    : 2
0.14/0.42	# ...of the previous two non-redundant : 2
0.14/0.42	# ...aggressively subsumed             : 0
0.14/0.42	# Contextual simplify-reflections      : 0
0.14/0.42	# Paramodulations                      : 0
0.14/0.42	# Factorizations                       : 0
0.14/0.42	# NegExts                              : 0
0.14/0.42	# Equation resolutions                 : 0
0.14/0.42	# Propositional unsat checks           : 0
0.14/0.42	#    Propositional check models        : 0
0.14/0.42	#    Propositional check unsatisfiable : 0
0.14/0.42	#    Propositional clauses             : 0
0.14/0.42	#    Propositional clauses after purity: 0
0.14/0.42	#    Propositional unsat core size     : 0
0.14/0.42	#    Propositional preprocessing time  : 0.000
0.14/0.42	#    Propositional encoding time       : 0.000
0.14/0.42	#    Propositional solver time         : 0.000
0.14/0.42	#    Success case prop preproc time    : 0.000
0.14/0.42	#    Success case prop encoding time   : 0.000
0.14/0.42	#    Success case prop solver time     : 0.000
0.14/0.42	# Current number of processed clauses  : 2
0.14/0.42	#    Positive orientable unit clauses  : 2
0.14/0.42	#    Positive unorientable unit clauses: 0
0.14/0.42	#    Negative unit clauses             : 0
0.14/0.42	#    Non-unit-clauses                  : 0
0.14/0.42	# Current number of unprocessed clauses: 1
0.14/0.42	# ...number of literals in the above   : 1
0.14/0.42	# Current number of archived formulas  : 0
0.14/0.42	# Current number of archived clauses   : 5
0.14/0.42	# Clause-clause subsumption calls (NU) : 0
0.14/0.42	# Rec. Clause-clause subsumption calls : 0
0.14/0.42	# Non-unit clause-clause subsumptions  : 0
0.14/0.42	# Unit Clause-clause subsumption calls : 0
0.14/0.42	# Rewrite failures with RHS unbound    : 0
0.14/0.42	# BW rewrite match attempts            : 1
0.14/0.42	# BW rewrite match successes           : 1
0.14/0.42	# Condensation attempts                : 7
0.14/0.42	# Condensation successes               : 0
0.14/0.42	# Termbank termtop insertions          : 294
0.14/0.42	
0.14/0.42	# -------------------------------------------------
0.14/0.42	# User time                : 0.004 s
0.14/0.42	# System time              : 0.000 s
0.14/0.42	# Total time               : 0.004 s
0.14/0.42	# Maximum resident set size: 1780 pages
0.14/0.42	
0.14/0.42	# -------------------------------------------------
0.14/0.42	# User time                : 0.004 s
0.14/0.42	# System time              : 0.002 s
0.14/0.42	# Total time               : 0.006 s
0.14/0.42	# Maximum resident set size: 1708 pages
0.14/0.42	EOF